Fast Binary Image Processing Using Binary Decision Diagrams
نویسندگان
چکیده
منابع مشابه
Fast Binary Image Processing Using Binary Decision Diagrams
Many classical image processing tasks can be realized as evaluations of a boolean function over subsets of an image. For instance, the simplicity test used in 3D thinning requires examining the 26 neighbors of each voxel and computing a single boolean function of these inputs. In this article, we show how Binary Decision Diagrams can be used to produce automatically very efficient and compact c...
متن کاملEfficient Processing of Minkowski Functionals on a 3D Binary Image Using Binary Decision Diagrams
The Morphological Image Analysis characterizes binary digitized 3D images in terms of shape (geometry) and connectivity (topology) by means of the Minkowski functionals known from integral geometry. In three dimensions, these functionals correspond to the enclosed volume, surface area, mean breadth and connectivity (Euler characteristic). To compute these functionals, it is necessary to count t...
متن کاملEquational Binary Decision Diagrams Equational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملCompressing Binary Decision Diagrams
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node. Empirical results for our compression technique are presented, including comparis...
متن کاملEquational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision and Image Understanding
سال: 1998
ISSN: 1077-3142
DOI: 10.1006/cviu.1997.0655